Papers with knowledge base completion
Type-Sensitive Knowledge Base Inference Without Explicit Type Supervision (P18-2)
Copied to clipboard
| Challenge: | State-of-the-art knowledge base completion models make frequent errors when ranking entities that are not compatible with the type required by the relation. |
| Approach: | They propose to enhance each base factorization with two type-compatibility terms between entity-relation pairs and combine the signals in a novel manner. |
| Outcome: | The proposed model achieves 7% MRR gains over baseline models and predicts supervised types better than baseline models. |
OpenFact: Factuality Enhanced Open Knowledge Extraction (2023.tacl-1)
Copied to clipboard
Linfeng Song, Ante Wang, Xiaoman Pan, Hongming Zhang, Dian Yu, Lifeng Jin, Haitao Mi, Jinsong Su, Yue Zhang, Dong Yu
| Challenge: | Existing OIE systems organize knowledge into subject-relation-object (SRO) triplets, and they use templates to extract such knowledge triplet. |
| Approach: | They propose a framework to handle expressiveness and groundedness in OpenFact . they propose to use templates, extra constraints, and adopt human efforts to ensure that most triplets contain enough details. |
| Outcome: | The proposed framework improves expressiveness and groundedness of OpenFact . it is more accurate and denser than OPIEC-Linked, which is grounded to Wikidata . |
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network (N18-2)
Copied to clipboard
| Challenge: | Existing knowledge base embedding models are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose a convolutional neural network embedding model for knowledge base completion that captures global relationships and transitional characteristics. |
| Outcome: | The proposed model outperforms state-of-the-art models on two benchmark datasets. |
Why does PairDiff work? - A Mathematical Analysis of Bilinear Relational Compositional Operators for Analogy Detection (C18-1)
Copied to clipboard
| Challenge: | Existing methods for representing semantic relations between words are unclear . identifying relations between word and entity is important for NLP applications . |
| Approach: | They propose to compute the vector offset between word embeddings to represent relation between two words . they show that PairDiff is an uncorrelated bilinear operator that can be simplified to a linear form . |
| Outcome: | The proposed method is surprisingly accurate and can be used on multiple word embeddings. |
DOCENT: Learning Self-Supervised Entity Representations from Large Document Collections (2021.eacl-main)
Copied to clipboard
Yury Zemlyanskiy, Sudeep Gandhe, Ruining He, Bhargav Kanagal, Anirudh Ravula, Juraj Gottweis, Fei Sha, Ilya Eckstein
| Challenge: | Using pre-trained models, we learn to jointly predict words and entities from multiple text sources without any human supervision. |
| Approach: | They propose to learn rich self-supervised entity representations from large amounts of associated text. |
| Outcome: | The proposed models outperform baseline models on downstream tasks in the TV-Movies domain, and scale to very large corpora. |
Neural Relation Extraction via Inner-Sentence Noise Reduction and Transfer Learning (D18-1)
Copied to clipboard
| Challenge: | Existing methods for extracting relations are slow and lack precision . a novel approach to extract relations is proposed to reduce noise between sentences . |
| Approach: | They propose a word-level distant supervised approach for relation extraction using New York Times and Freebase. |
| Outcome: | The proposed method improves the area of precision/call(PR) from 0.35 to 0.39 over the state-of-the-art methods. |
Fact Discovery from Knowledge Base via Facet Decomposition (N19-1)
Copied to clipboard
| Challenge: | Recent years have witnessed the emergence and growth of many large-scale knowledge bases (KBs) however, there are some issues unsettled towards enriching the KBs. |
| Approach: | They propose a framework that decomposes the discovery problem into several facet components and an auto-encoder component to estimate some facets of the fact. |
| Outcome: | The proposed framework achieves promising results on a benchmark dataset. |
Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs (P19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs (KGs) are incomplete or partial information, in the form of missing relations between entities, which gives rise to the task of knowledge base completion (also known as relation prediction). |
| Approach: | They propose to capture both entity and relation features in any given neighborhood and encapsulate relation clusters and multi-hop relations in their attention-based model. |
| Outcome: | The proposed model captures both entity and relation features in any given neighborhood and also encapsulates relation clusters and multi-hop relations. |
Knowledge Base Completion Meets Transfer Learning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge bases are tedious and require a large amount of labor to build. |
| Approach: | They propose a method that allows for transfer of knowledge from one collection of facts to another without entity or relation matching. |
| Outcome: | The proposed method is the most impactful on small datasets, showing a 6% increase in rank and 65% decrease in rank over the previous best method. |
Exploiting Structured Knowledge in Text via Graph-Guided Representation Learning (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for integrating knowledge graphs into pre-trained language models have been poorly implemented. |
| Approach: | They propose a self-supervised entity masking scheme that exploits relational knowledge underlying the text. |
| Outcome: | The proposed model achieves improved performance on five benchmarks, including question answering and knowledge base completion. |
Joint Knowledge Base Completion and Question Answering by Combining Large Language Models and Small Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing studies rely on the small language model (SLM) to enhance them jointly, and the large language model’s strong reasoning ability is ignored. |
| Approach: | They propose a framework which can make knowledge base completion and knowledge base question answering enhance each other in an iterative manner by combining the strengths of the small language model and the large language model. |
| Outcome: | The proposed framework surpasses baselines for both KBC and KBQA tasks over two public benchmark data sets. |